A crystal theoretic method for finding rigged configurations from paths

نویسنده

  • Reiho Sakamoto
چکیده

The Kerov–Kirillov–Reshetikhin (KKR) bijection gives one to one correspondences between the set of highest paths and the set of rigged configurations. In this paper, we give a crystal theoretic reformulation of the KKR map from the paths to rigged configurations, using the combinatorial R and energy functions. It makes the large scale structure of the combinatorial procedure of the KKR bijection transparent.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Crystal interpretation of Kerov–Kirillov–Reshetikhin bijection II. Proof for sln case

In proving the Fermionic formulae, a combinatorial bijection called the Kerov–Kirillov–Reshetikhin (KKR) bijection plays the central role. It is a bijection between the set of highest paths and the set of rigged configurations. In this paper, we give a proof of crystal theoretic reformulation of the KKR bijection. It is the main claim of Part I written by A. Kuniba, M. Okado, T. Takagi, Y. Yama...

متن کامل

Crystal Structure on Rigged Configurations

There are (at least) two main approaches to solvable lattice models and their associated quantum spin chains: the Bethe ansatz [6] and the corner transfer matrix method [5]. In his paper [6], Bethe solved the Heisenberg spin chain based on the string hypothesis which asserts that the eigenvalues of the Hamiltonian form certain strings in the complex plane as the size of the system tends to infi...

متن کامل

Rigged Configurations and the Bethe Ansatz

This note is a review of rigged configurations and the Bethe Ansatz. In the first part, we focus on the algebraic Bethe Ansatz for the spin 1/2 XXX model and explain how rigged configurations label the solutions of the Bethe equations. This yields the bijection between rigged configurations and crystal paths/Young tableaux of Kerov, Kirillov and Reshetikhin. In the second part, we discuss a gen...

متن کامل

Finding Rigged Configurations From Paths

in terms of the crystal bases theory [K] and its application to the periodic box-ball systems following [S2] and [KS3]. The bijection φ was originally introduced in order to show the so-called X = M formula (see [O, S4] for reviews) by using its statistic preserving property. Recently, another application of the bijection φ to the box-ball systems [TS, T] was found [KOSTY]. In this context, the...

متن کامل

New fermionic formula for unrestricted Kostka polynomials

A new fermionic formula for the unrestricted Kostka polynomials of type A (1) n−1 is presented. This formula is different from the one given by Hatayama et al. and is valid for all crystal paths based on Kirillov–Reshetihkin modules, not just for the symmetric and anti-symmetric case. The fermionic formula can be interpreted in terms of a new set of unrestricted rigged configurations. For the p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008